A DEVELOPMENT TOWARD MATCHING PURSUIT ALGORITHM AIMS TO REDUCE CALCULATION MASS IN THE PROCESS OF THE COMPESSED SAMPLING AND ERRORS IN THE SIGNAL RECOVERY PROCESS ☆

Many works related to the signal restoration from discrete samples that are unsatisfactory requirements of Nyquist’s criteria has been deployed and published recently.There were many algorithms to solve this issue, such as CoSaMP and the matching pursuit. This article presents a developed algorithm which is based on the matching pursuit algorithm to recover multi-dimensional architectures. This development is permissible to reduce the calculation mass in several cases along with a number of dedicated conditions when sampling signal compression. Simultaneously, the article will demonstrate this algorithm also makes reduce the occurred error at each step in the signal recovery process by using the mathematical method.